SOLVING RESOURCE-CONSTRAINED CONSTRUCTION SCHEDULING PROBLEMS WITH OVERLAPS BY METAHEURISTIC
نویسندگان
چکیده
منابع مشابه
solving the resource-constrained project scheduling problems (rcpsp) using developed imperialistic competition algorithm (dica)
the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...
متن کاملA Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems
The project resource leveling problem was proposed to smooth resource usage and reduce resource fluctuation, while the resource-constrained project scheduling problem focuses on minimizing the project duration with limited resources. Solving the two interrelated problems separately is unlikely to result in a globally optimum schedule. The few integrated optimization methods that have been devel...
متن کاملModeling and solving multi-skilled resource-constrained project scheduling problem with calendars in fuzzy condition
In this study, we aim to present a new model for the resource-constrained project scheduling problem (RCPSP) considering a working calendar for project members and determined the skill factor of any member using the efficiency concept. For this purpose, the recyclable resources are staff resources where any person with multiple skills can meet the required skills of activities in a given time. ...
متن کاملSplittable stochastic project scheduling with constrained renewable resource
This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...
متن کاملResource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
We propose a novel approach to compute bounds on the objective function value of a wide class of resource-constrained project scheduling problems. The basis is a polynomial-time algorithm to solve the following scheduling problem: Given a set of activities with start-time dependent costs and temporal constraints in the form of time windows, find a feasible schedule of minimum total cost. Motiva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT
سال: 2014
ISSN: 1392-3730,1822-3605
DOI: 10.3846/13923730.2014.906496